Polyhedral combinatorics - PDFSEARCH.IO - Document Search Engine

Polyhedral combinatorics
Results: 46

#	Item
21	CCCG 2011, Toronto ON, August 10–12, 2011 Pushing the boundaries of polytopal realizability David Bremner∗ Antoine Deza† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:14 Algebraic topology Topology Conjectures Hirsch conjecture Convex polytope Simplex Facet Simple polytope 5-polytope Geometry Polytopes Polyhedral combinatorics
22	Computing All Faces of the Minkowski Sum of V-Polytopes∗ K. Fukuda Ch. Weibel June 29, 2005 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:54 Simplex Polyhedral combinatorics Abstract polytope Geometry Polytopes Convex polytope
23	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On a Cone Covering Problem Khaled Elbassioni∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:10:44 Linear programming Convex hull Cross-polytope Duality Cone Polyhedral combinatorics Abstract polytope Geometry Polytopes Convex polytope
24	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 On a Cone Covering Problem Khaled Elbassioni∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:04:09 Linear programming Convex hull Cross-polytope Duality Cone Polyhedral combinatorics Abstract polytope Geometry Polytopes Convex polytope
25	Proceedings of the 1991 IEEE IntemationalConference m Robotics and Automation Sacramento,California - April 1991 A Fast Algorithm for Incremental Distance Calculation Ming C. Lin and John F. Canny Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-04-17 17:09:32 Polyhedron Vertex Collision detection Platonic solid Polyhedral combinatorics Geometry Polytopes Polyhedra
26	Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomial Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 23:59:42 Convex polytope Linear programming Duality Tree Graph Abstract polytope Polyhedral combinatorics Geometry Polytopes Mathematics
27	SQUARING RECTANGLES: THE FINITE RIEMANN MAPPING THEOREM J. W. Cannon, W. J. Floyd and W. R. Parry Abstract. The classical Riemann mapping theorem asserts that any topological quadrilateral in the complex plane can be map Add to Reading List Source URL: www.math.vt.edu Language: English - Date: 2015-02-13 14:19:01 Topological graph theory Polyhedral combinatorics Quadrilaterals Rectangle Riemann surface Tessellation Euler characteristic Geometry Mathematics Topology
28	Learning Bayesian Network Structure using LP Relaxations Tommi Jaakkola MIT CSAIL David Sontag Add to Reading List Source URL: jmlr.org Language: English - Date: 2010-03-31 18:51:07 Applied mathematics Linear programming Convex optimization Constraint programming Linear programming relaxation Bayesian network Directed acyclic graph Duality Polyhedral combinatorics Mathematical optimization Mathematics Operations research
29	Errata: An Introduction to Optimization, Fourth Edition by ˙ Edwin K. P. Chong and Stanislaw H. Zak February 21, 2015 Add to Reading List Source URL: www.engr.colostate.edu Language: English - Date: 2015-02-21 20:43:38 Convex polytope Abstract polytope Polyhedral combinatorics Geometry Polytopes Polyhedron
30	Candidate Betti numbers for the linear homology of convex polytopes Jonathan Fine 25 February 2013 Add to Reading List Source URL: jonathanfine.files.wordpress.com Language: English - Date: 2013-02-25 11:54:37 Polytopes Algebraic topology Polyhedral combinatorics Topological graph theory Betti number Dehn–Sommerville equations Convex polytope Duality Vector space Mathematics Algebra Geometry

UPDATE